Theorems and postulates of Boolean Algebra

Working as a computer – Logic Gates

“Logic Gates” Module Development Scenario: Digital Electronics

Digital Electronics with Logic Gates module

Session 1: Number and code systems

Session 2 Boolean Algebra: bases, theorems and logic gates

Boolean Algebra bases

Boolean Algebra: basic operations

Boolean basic and non-basic operators

Obtain the truth table from any Boolean expression

Obtain the truth table from a logic circuit

Theorems and postulates of Boolean Algebra

Duality principle (Meta-theorem)

Proof of a Boolean theorem through perfect induction

Negate a Boolean expression

Obtaining the logic function from the truth table: Shannon Theorem

Use of BOOLE-DEUSTO

Session 2: Exercises

Remote Laboratory with Session 2

Session 3: Boolean Minimization

Session 4. Bit-level design of combinational systems (with logic bits)

Session 5: Final project

Theorems and postulates of Boolean Algebra

The following table summarizes the most significant properties and theorems for Boolean Algebra.

« Previous | Next »